Robust goal programming
نویسندگان
چکیده
In the paper a new approach to goal programming is presented: the robust approach, applied so far to a single-objective linear programming. It is a ”pessimistic” approach, meant to find a solution which will be reasonably good even in a bad case, but it is based on the assumption that almost never everything goes bad the decision maker can control and simulate the pessimistic aspect of the decision situation. The pessimism refers here to uncertain coefficients in the goal functions. It is assumed that in each case only a certain number of them can take on unfavourable values but we do not know which ones. A robust solution, i.e. the one which will be good even in the most pessimistic case among those considered to be possible is determined, using only the linear programming methods.
منابع مشابه
A two-stage robust model for portfolio selection by using goal programming
In portfolio selection models, uncertainty plays an important role. The parameter’s uncertainty leads to getting away from optimal solution so it is needed to consider that in models. In this paper we presented a two-stage robust model that in first stage determines the desired percentage of investment in each industrial group by using return and risk measures from different industries. One rea...
متن کاملA hybrid solution approach for a multi-objective closed-loop logistics network under uncertainty
The design of closed-loop logistics (forward and reverse logistics) has attracted growing attention with the stringent pressures of customer expectations, environmental concerns and economic factors. This paper considers a multi-product, multi-period and multi-objective closed-loop logistics network model with regard to facility expansion as a facility location–allocation problem, which more cl...
متن کاملA Heuristic Algorithm for Nonlinear Lexicography Goal Programming with an Efficient Initial Solution
In this paper, a heuristic algorithm is proposed in order to solve a nonlinear lexicography goal programming (NLGP) by using an efficient initial point. Some numerical experiments showed that the search quality by the proposed heuristic in a multiple objectives problem depends on the initial point features, so in the proposed approach the initial point is retrieved by Data Envelopment Analysis...
متن کاملRobust Design of Dynamic Cell Formation Problem Considering the Workers Interest
To enhance agility and quick responding to customers' demand, manufacturing processes are rearrenged according to different systems. The efficient execution of a manufacturing system depends on various factors. Among them, cell design and human issue are the pivotal ones. The proposed model designs cellular manufacturing systems using three objective functions from three different perspectives,...
متن کاملA dynamic bi-objective model for after disaster blood supply chain network design; a robust possibilistic programming approach
Health service management plays a crucial role in human life. Blood related operations are considered as one of the important components of the health services. This paper presents a bi-objective mixed integer linear programming model for dynamic location-allocation of blood facilities that integrates strategic and tactical decisions. Due to the epistemic uncertain nature of ...
متن کاملA Robust credibility-based fuzzy programming for supply chain optimization in lean manufacturing environment
Lean manufacturing is a strategic concern for companies which conduct mass production and it has become even more significant for those producing in a project-oriented way by modularization. In this paper, a bi-objective optimization model is proposed to design and plan a supply chain up to the final assembly centre. The delivery time and the quality in the procurement and low fluctuation of t...
متن کامل